Hilbert’s Irreducibility Theorem via Random Walks

نویسندگان

چکیده

Abstract Let $G$ be a connected linear algebraic group over number field $K$, let $\Gamma $ finitely generated Zariski dense subgroup of $G(K)$, and $Z\subseteq G(K)$ thin set, in the sense Serre. We prove that, if $G/\textrm {R}_{u}(G)$ is either trivial or semisimple $Z$ satisfies certain necessary conditions, then long random walk on Cayley graph hits elements with negligible probability. deduce corollaries to Galois covers, characteristic polynomials, fixed points actions. also analogous results case where $K$ global function field.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Amenability via random walks

We use random walks to show that the Basilica group is amenable, answering an open question of Grigorchuk and Żuk. Our results separate the class of amenable groups from the closure of subexponentially growing groups under the operations of group extension and direct limits; these classes are separated even within the realm of finitely presented groups.

متن کامل

Random Walks and Foster’s Resistance Theorem

Given any simple connected graph G =< V,E > such that each edge e ∈ E has unit resistance, Foster’s Resistance Theorem states that the summation of effective resistances over all edges equals n− 1. That is, ∑ e∈E Re = n− 1 Further, given a general graph with resistances re corresponding to edges e ∈ E, the theorem states: ∑ e∈E Re re = n− 1 Tetali[1] proved Foster’s Resistance Theorem by consid...

متن کامل

Oblivious Routing via Random Walks

We present novel oblivious routing algorithms for both splittable and unsplittable multicommodity flow. Our algorithm for minimizing congestion for unsplittable multicommodity flow is the first oblivious routing algorithm for this setting. As an intermediate step towards this algorithm, we present a novel generalization of Valiant’s classical load balancing scheme for packet-switched networks t...

متن کامل

Central Limit Theorem for Branching Random Walks in Random Environment

We consider branching random walks in d-dimensional integer lattice with time-space i.i.d. offspring distributions. When d ≥ 3 and the fluctuation of the environment is well moderated by the random walk, we prove a central limit theorem for the density of the population, together with upper bounds for the density of the most populated site and the replica overlap. We also discuss the phase tran...

متن کامل

A Central Limit Theorem for Random Walks in Random Labyrinths

Carol Bezuidenhout and Geoffrey Grimmett Abstract. A beam of light shines through the lattice Zd, and is subjected to reflections determined by a random environment of mirrors at the vertices of Zd. The behaviour of the light ray is investigated under the hypothesis that the environment contains a strictly positive density of vertices at which the light behaves in the manner of a random walk. W...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Mathematics Research Notices

سال: 2022

ISSN: ['1687-0247', '1073-7928']

DOI: https://doi.org/10.1093/imrn/rnac188